منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملElliptic Curve Cryptosystems
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2"). We discuss the question of prim...
متن کاملImplementing Elliptic Curve Cryptosystems
In 1987 Neil Koblitz first suggested the use of Elliptic curves for Public Key Cryptosystems. This has triggered publications about ECC (Elliptic Curve Cryptography) in recent years as well as the appearance of first University textbooks about that topic. Some Mathematicians and Computer Scientists have focused their studies of Elliptic curves on efficiency and security of ECC. Questions arise ...
متن کاملImplementation of Elliptic Curve Cryptosystems
During the last few years, a considerable effort has been devoted to the development of reconfigurable computers, machines that are based on the close interoperation of traditional microprocessors and Field Programmable Gate Arrays (FPGAs). Several prototype machines of this type have been designed, and demonstrated significant speedups compared to conventional workstations for computationally ...
متن کاملMiyaji : on Elliptic Curve Cryptosystems
From a practical point of view, a cryptosystem should require a small key size and less running time. For this purpose, we often select its definition field in such a way that the arithmetic can be implemented fast. But it often brings attacks which depend on the definition field. In this paper, we investigate the definition field F on which elliptic curve cryptosystems can be implemented fast,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1987
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1987-0866109-5